Diversified top-k clique search
نویسندگان
چکیده
منابع مشابه
Diversified Top-k Similarity Search in Large Attributed Networks
Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graphbased applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed...
متن کاملDiversified Top-k Partial MaxSAT Solving
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k, the diversified top-k partial MaxSAT is to find k maximal solutions for F such that the k maximal solutions satisfy the maximum number of soft clauses of F . This problem can be widely used in many applications inclu...
متن کاملDiversified Top-k Graph Pattern Matching
Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q,G) of matches of Q in G. However, these algorithms often return an excessive number of matches, and are expensive on large real-life social graphs. Moreover, in practice many social queries are to find mat...
متن کاملDiversified Top-k Keyword Query Interpretation on Knowledge Graphs
Exploring a knowledge graph through keyword queries to discover meaningful patterns has been studied in many scenarios recently. From the perspective of query understanding, it aims to find a number of specific interpretations for ambiguous keyword queries. With the assistance of interpretation, the users can actively reduce the search space and get more relevant results. In this paper, we prop...
متن کاملScaling up top-K cosine similarity search
Article history: Received 21 September 2009 Received in revised form 23 August 2010 Accepted 23 August 2010 Available online 8 September 2010 Recent years have witnessed an increased interest in computing cosine similarity in many application domains. Most previous studies require the specification of a minimum similarity threshold to perform the cosine similarity computation. However, it is us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2015
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-015-0408-z